Weakly transitive matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weakly s-arc transitive graphs

Weakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s-arc transitive if its endomorphism monoid acts transitively on the set of s-arcs. The main results are: (1) A nonbipartite graph is weakly s-arc transitive if and only if it is s-arc transitive. (2) A tree with diameter d is weakly s-arc transitive for all 0 s d. (3) A bipartite graph with girth g = 2s ...

متن کامل

On Generalized Transitive Matrices

Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiring is called incline algebra which generalizes Boolean algebra, fuzzy algebra, and distributive lattice. This paper studies the transitive incline matrices in detail. The transitive closure of an incline matrix is studied, and the convergence for powers of transitive incline matrices is considere...

متن کامل

Weakly Flag-transitive Configurations and Half-arc-transitive Graphs

A connguration is weakly ag-transitive if its group of automor-phisms acts intransitively on ags but the group of all automorphisms and anti-automorphisms acts transitively on ags. It is shown that weakly ag-transitive conngurations are in one-to-one correspondence with bipartite 1 2-arc-transitive graphs of girth not less than 6. Several innnite families of weakly ag-transitive conngurations a...

متن کامل

Weakly Flag-transitive Configurations and Half-arc-transitive Graphs

A con guration is weakly ag transitive if its group of automor phisms acts intransitively on ags but the group of all automorphisms and anti automorphisms acts transitively on ags It is shown that weakly ag transitive con gurations are in one to one correspondence with bipartite  arc transitive graphs of girth not less than Sev eral in nite families of weakly ag transitive con gurations are gi...

متن کامل

Recognizing Weakly Stable Matrices

A max-plus matrixA is called weakly stable if the sequence (orbit) x,A⊗x, A2⊗x, . . . does not reach an eigenvector of A for any x unless x is an eigenvector. This is in contrast to previously studied strongly stable (robust) matrices for which the orbit reaches an eigenvector with any nontrivial starting vector. Max-plus matrices are used to describe multiprocessor interactive systems for whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Illinois Journal of Mathematics

سال: 1984

ISSN: 0019-2082

DOI: 10.1215/ijm/1256046065